0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.11/0.32 % Computer : n008.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 1920 0.11/0.32 % WCLimit : 240 0.11/0.32 % DateTime : Wed Jul 30 05:04:04 EDT 2025 0.11/0.33 % CPUTime : 0.20/0.47 Running higher-order theorem proving 0.36/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.P4huidnzk7/E---3.1_985.p 0.37/0.56 # Version: 3.0.0-ho 0.37/0.56 # Preprocessing class: HSLSSMSSSSSNHSA. 0.37/0.56 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.37/0.56 # Starting full_lambda_9 with 1200s (5) cores 0.37/0.56 # Starting new_ho_11 with 240s (1) cores 0.37/0.56 # Starting sh2l with 240s (1) cores 0.37/0.56 # Starting new_bool_6 with 240s (1) cores 0.37/0.56 # new_bool_6 with pid 1089 completed with status 0 0.37/0.56 # Result found by new_bool_6 0.37/0.56 # Preprocessing class: HSLSSMSSSSSNHSA. 0.37/0.56 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.37/0.56 # Starting full_lambda_9 with 1200s (5) cores 0.37/0.56 # Starting new_ho_11 with 240s (1) cores 0.37/0.56 # Starting sh2l with 240s (1) cores 0.37/0.56 # Starting new_bool_6 with 240s (1) cores 0.37/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.0,,1,20000,1.0) 0.37/0.56 # Search class: HGUSM-FFMF32-MHSFFSNN 0.37/0.56 # partial match(3): HGUSM-FFMF32-SHSFMSBN 0.37/0.56 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.37/0.56 # Starting new_ho_10 with 44s (1) cores 0.37/0.56 # new_ho_10 with pid 1091 completed with status 0 0.37/0.56 # Result found by new_ho_10 0.37/0.56 # Preprocessing class: HSLSSMSSSSSNHSA. 0.37/0.56 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.37/0.56 # Starting full_lambda_9 with 1200s (5) cores 0.37/0.56 # Starting new_ho_11 with 240s (1) cores 0.37/0.56 # Starting sh2l with 240s (1) cores 0.37/0.56 # Starting new_bool_6 with 240s (1) cores 0.37/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.0,,1,20000,1.0) 0.37/0.56 # Search class: HGUSM-FFMF32-MHSFFSNN 0.37/0.56 # partial match(3): HGUSM-FFMF32-SHSFMSBN 0.37/0.56 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.37/0.56 # Starting new_ho_10 with 44s (1) cores 0.37/0.56 # Preprocessing time : 0.004 s 0.37/0.56 # Presaturation interreduction done 0.37/0.56 0.37/0.56 # Proof found! 0.37/0.56 # SZS status Theorem 0.37/0.56 # SZS output start CNFRefutation 0.37/0.56 thf(decl_sort1, type, a: $tType). 0.37/0.56 thf(decl_sort2, type, c: $tType). 0.37/0.56 thf(decl_sort3, type, b: $tType). 0.37/0.56 thf(decl_sort4, type, set_a: $tType). 0.37/0.56 thf(decl_sort5, type, set_c: $tType). 0.37/0.56 thf(decl_27, type, comp_a_b_c: (a > b) > (c > a) > c > b). 0.37/0.56 thf(decl_53, type, inj_on_a_b: (a > b) > set_a > $o). 0.37/0.56 thf(decl_62, type, sup_sup_set_a: set_a > set_a > set_a). 0.37/0.56 thf(decl_71, type, top_top_set_c: set_c). 0.37/0.56 thf(decl_81, type, image_c_a: (c > a) > set_c > set_a). 0.37/0.56 thf(decl_88, type, f: a > b). 0.37/0.56 thf(decl_89, type, g: c > a). 0.37/0.56 thf(decl_90, type, h: c > a). 0.37/0.56 thf(fact_136_sup__commute, axiom, ((sup_sup_set_a)=(^[X22:set_a, X23:set_a]:(sup_sup_set_a @ X23 @ X22))), file('/export/starexec/sandbox2/tmp/tmp.P4huidnzk7/E---3.1_985.p', fact_136_sup__commute)). 0.37/0.56 thf(fact_8_o__inj__on, axiom, ![X509:a > b, X510:c > a, X511:c > a]:(((((X510)=(X511))<=(inj_on_a_b @ X509 @ (sup_sup_set_a @ (image_c_a @ X510 @ top_top_set_c) @ (image_c_a @ X511 @ top_top_set_c))))<=((comp_a_b_c @ X509 @ X510)=(comp_a_b_c @ X509 @ X511)))), file('/export/starexec/sandbox2/tmp/tmp.P4huidnzk7/E---3.1_985.p', fact_8_o__inj__on)). 0.37/0.56 thf(conj_2, conjecture, ((g)=(h)), file('/export/starexec/sandbox2/tmp/tmp.P4huidnzk7/E---3.1_985.p', conj_2)). 0.37/0.56 thf(conj_0, hypothesis, (inj_on_a_b @ f @ (sup_sup_set_a @ (image_c_a @ g @ top_top_set_c) @ (image_c_a @ h @ top_top_set_c))), file('/export/starexec/sandbox2/tmp/tmp.P4huidnzk7/E---3.1_985.p', conj_0)). 0.37/0.56 thf(conj_1, hypothesis, ((comp_a_b_c @ f @ g)=(comp_a_b_c @ f @ h)), file('/export/starexec/sandbox2/tmp/tmp.P4huidnzk7/E---3.1_985.p', conj_1)). 0.37/0.56 thf(c_0_5, plain, ![X1153:set_a, X1154:set_a]:(((sup_sup_set_a @ X1153 @ X1154)=(sup_sup_set_a @ X1154 @ X1153))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_136_sup__commute])])). 0.37/0.56 thf(c_0_6, plain, ![X509:a > b, X510:c > a, X511:c > a]:((((comp_a_b_c @ X509 @ X510)=(comp_a_b_c @ X509 @ X511))=>((inj_on_a_b @ X509 @ (sup_sup_set_a @ (image_c_a @ X510 @ top_top_set_c) @ (image_c_a @ X511 @ top_top_set_c)))=>((X510)=(X511))))), inference(fof_simplification,[status(thm)],[fact_8_o__inj__on])). 0.37/0.56 thf(c_0_7, plain, ![X1277:set_a, X1278:set_a]:(((sup_sup_set_a @ X1277 @ X1278)=(sup_sup_set_a @ X1278 @ X1277))), inference(variable_rename,[status(thm)],[c_0_5])). 0.37/0.56 thf(c_0_8, negated_conjecture, ((g)!=(h)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_2])])). 0.37/0.56 thf(c_0_9, plain, ![X1301:a > b, X1302:c > a, X1303:c > a]:((((comp_a_b_c @ X1301 @ X1302)!=(comp_a_b_c @ X1301 @ X1303))|(~(inj_on_a_b @ X1301 @ (sup_sup_set_a @ (image_c_a @ X1302 @ top_top_set_c) @ (image_c_a @ X1303 @ top_top_set_c)))|((X1302)=(X1303))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])). 0.37/0.56 thf(c_0_10, hypothesis, (inj_on_a_b @ f @ (sup_sup_set_a @ (image_c_a @ g @ top_top_set_c) @ (image_c_a @ h @ top_top_set_c))), inference(split_conjunct,[status(thm)],[conj_0])). 0.37/0.56 thf(c_0_11, plain, ![X2:set_a, X1:set_a]:(((sup_sup_set_a @ X1 @ X2)=(sup_sup_set_a @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.37/0.56 thf(c_0_12, negated_conjecture, ((g)!=(h)), inference(fof_nnf,[status(thm)],[c_0_8])). 0.37/0.56 thf(c_0_13, plain, ![X12:a > b, X16:c > a, X26:c > a]:((((X16)=(X26))|((comp_a_b_c @ X12 @ X16)!=(comp_a_b_c @ X12 @ X26))|~((inj_on_a_b @ X12 @ (sup_sup_set_a @ (image_c_a @ X16 @ top_top_set_c) @ (image_c_a @ X26 @ top_top_set_c)))))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.37/0.56 thf(c_0_14, hypothesis, (inj_on_a_b @ f @ (sup_sup_set_a @ (image_c_a @ h @ top_top_set_c) @ (image_c_a @ g @ top_top_set_c))), inference(rw,[status(thm)],[c_0_10, c_0_11])). 0.37/0.56 thf(c_0_15, hypothesis, ((comp_a_b_c @ f @ g)=(comp_a_b_c @ f @ h)), inference(split_conjunct,[status(thm)],[conj_1])). 0.37/0.56 thf(c_0_16, negated_conjecture, ((g)!=(h)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.37/0.56 thf(c_0_17, hypothesis, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])]), c_0_16]), ['proof']). 0.37/0.56 # SZS output end CNFRefutation 0.37/0.56 # Parsed axioms : 434 0.37/0.56 # Removed by relevancy pruning/SinE : 378 0.37/0.56 # Initial clauses : 82 0.37/0.56 # Removed in clause preprocessing : 5 0.37/0.56 # Initial clauses in saturation : 77 0.37/0.56 # Processed clauses : 136 0.37/0.56 # ...of these trivial : 10 0.37/0.56 # ...subsumed : 15 0.37/0.56 # ...remaining for further processing : 111 0.37/0.56 # Other redundant clauses eliminated : 3 0.37/0.56 # Clauses deleted for lack of memory : 0 0.37/0.56 # Backward-subsumed : 0 0.37/0.56 # Backward-rewritten : 1 0.37/0.56 # Generated clauses : 129 0.37/0.56 # ...of the previous two non-redundant : 73 0.37/0.56 # ...aggressively subsumed : 0 0.37/0.56 # Contextual simplify-reflections : 0 0.37/0.56 # Paramodulations : 117 0.37/0.56 # Factorizations : 0 0.37/0.56 # NegExts : 4 0.37/0.56 # Equation resolutions : 4 0.37/0.56 # Disequality decompositions : 0 0.37/0.56 # Total rewrite steps : 113 0.37/0.56 # ...of those cached : 72 0.37/0.56 # Propositional unsat checks : 0 0.37/0.56 # Propositional check models : 0 0.37/0.56 # Propositional check unsatisfiable : 0 0.37/0.56 # Propositional clauses : 0 0.37/0.56 # Propositional clauses after purity: 0 0.37/0.56 # Propositional unsat core size : 0 0.37/0.56 # Propositional preprocessing time : 0.000 0.37/0.56 # Propositional encoding time : 0.000 0.37/0.56 # Propositional solver time : 0.000 0.37/0.56 # Success case prop preproc time : 0.000 0.37/0.56 # Success case prop encoding time : 0.000 0.37/0.56 # Success case prop solver time : 0.000 0.37/0.56 # Current number of processed clauses : 53 0.37/0.56 # Positive orientable unit clauses : 11 0.37/0.56 # Positive unorientable unit clauses: 2 0.37/0.56 # Negative unit clauses : 2 0.37/0.56 # Non-unit-clauses : 38 0.37/0.56 # Current number of unprocessed clauses: 64 0.37/0.56 # ...number of literals in the above : 114 0.37/0.56 # Current number of archived formulas : 0 0.37/0.56 # Current number of archived clauses : 55 0.37/0.56 # Clause-clause subsumption calls (NU) : 322 0.37/0.56 # Rec. Clause-clause subsumption calls : 277 0.37/0.56 # Non-unit clause-clause subsumptions : 10 0.37/0.56 # Unit Clause-clause subsumption calls : 4 0.37/0.56 # Rewrite failures with RHS unbound : 0 0.37/0.56 # BW rewrite match attempts : 42 0.37/0.56 # BW rewrite match successes : 32 0.37/0.56 # Condensation attempts : 136 0.37/0.56 # Condensation successes : 0 0.37/0.56 # Termbank termtop insertions : 13175 0.37/0.56 # Search garbage collected termcells : 5472 0.37/0.56 0.37/0.56 # ------------------------------------------------- 0.37/0.56 # User time : 0.019 s 0.37/0.56 # System time : 0.004 s 0.37/0.56 # Total time : 0.023 s 0.37/0.56 # Maximum resident set size: 3212 pages 0.37/0.56 0.37/0.56 # ------------------------------------------------- 0.37/0.56 # User time : 0.036 s 0.37/0.56 # System time : 0.006 s 0.37/0.56 # Total time : 0.042 s 0.37/0.56 # Maximum resident set size: 2828 pages 0.37/0.56 % E exiting 0.37/0.57 % E exiting 0.37/0.57 EOF